The $${\mathcal {S}}$$-cone and a primal-dual view on second-order representability
نویسندگان
چکیده
منابع مشابه
On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection
We study the second-order feasibility cone F = {y ∈ IR : ‖My‖ ≤ g y} for given data (M, g). We construct a new representation for this cone and its dual based on the spectral decomposition of the matrix MM − gg . This representation is used to efficiently solve the problem of projecting an arbitrary point x ∈ IR onto F : miny{‖y − x‖ : ‖My‖ ≤ g y}, which aside from theoretical interest also ari...
متن کاملThe Primal-Dual Second-Order Cone Approximations Algorithm for Symmetric Cone Programming
This paper presents the new concept of second-order cone approximations for convex conic programming. Given any open convex cone K, a logarithmically homogeneous self-concordant barrier for K and any positive real number r ≤ 1, we associate, with each direction x ∈ K, a second-order cone K̂r(x) containing K. We show that K is the intersection of the second-order cones K̂r(x), as x ranges through ...
متن کاملA Polynomial Primal-Dual Path-Following Algorithm for Second-order Cone Programming
Second-order cone programming (SOCP) is the problem of minimizing linear objective function over cross-section of second-order cones and an a ne space. Recently this problem gets more attention because of its various important applications including quadratically constrained convex quadratic programming. In this paper we deal with a primal-dual path-following algorithm for SOCP to show many of ...
متن کاملA new Primal-Dual Interior-Point Algorithm for Second-Order Cone Optimization∗
We present a primal-dual interior-point algorithm for second-order conic optimization problems based on a specific class of kernel functions. This class has been investigated earlier for the case of linear optimization problems. In this paper we derive the complexity bounds O( √ N (logN) log N ) for largeand O( √ N log N ) for smallupdate methods, respectively. Here N denotes the number of seco...
متن کاملFull Nesterov-Todd Step Primal-Dual Interior-Point Methods for Second-Order Cone Optimization∗
After a brief introduction to Jordan algebras, we present a primal-dual interior-point algorithm for second-order conic optimization that uses full Nesterov-Todd-steps; no line searches are required. The number of iterations of the algorithm is O( √ N log(N/ε), where N stands for the number of second-order cones in the problem formulation and ε is the desired accuracy. The bound coincides with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry
سال: 2020
ISSN: 0138-4821,2191-0383
DOI: 10.1007/s13366-020-00512-9